On the Asymptotic Average Number of Efficient Vertices in Multiple Objective Linear Programming

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Asymptotic Average Number of Efficient Vertices in Multiple Objective Linear Programming

Let a1 , ..., am , c1 , ..., ck be independent random points in R that are identically distributed spherically symmetrical in R and let X :=[x # R|ai x 1, i=1, ..., m] be the associated random polyhedron for m n 2. We consider multiple objective linear programming problems maxx # X c1 x, maxx # X c T 2 x, ..., maxx # X c T k x with 1 k n. For distributions with algebraically decreasing tail in ...

متن کامل

A regression study of the number of efficient extreme points in multiple objective linear programming

In this paper we employ regression analysis to construct relationships for predicting the number of efficient extreme points in MOLPs (multiple objective linear programs) with up to 120,000 efficient extreme points, and the CPU time to compute them. Principal among the factors affecting the number of efficient extreme points and CPU time are the number of objectives, criterion cone size, number...

متن کامل

On duality in multiple objective linear programming

We discuss two approaches to duality for multiple objective linear problems. The first approach is based on a duality relation between a set and its complement in the outcome space. It allows us to obtain a number of known duality constructions. The second approach utilizes polarity between a polyhedral set and the epigraph of its support function. It leads to a parametric dual problem which is...

متن کامل

Computing efficient solutions to fuzzy multiple objective linear programming problems

In this paper, we improve the fuzzy compromise approach of Guu and Wu by automatically computing proper membership thresholds instead of choosing them. Indeed, in practice, choosing membership thresholds arbitrarily may result in an infeasible optimization problem. Although we can adjust minimum satisfaction degree to get fuzzy efficient solution, it sometimes makes the process of interactionmo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 1998

ISSN: 0885-064X

DOI: 10.1006/jcom.1998.0480